Solving 10385 - Duathlon (Ternary search)
[andmenj-acm.git] / 11526 - H(n) / gen.cpp
blob3bb65ff0e5a67c0a4894666dc09369aa102492ae
1 /*
2 Problem:
3 Andrés Mejía-Posada (andmej@gmail.com)
4 */
5 using namespace std;
6 #include <algorithm>
7 #include <iostream>
8 #include <iterator>
9 #include <sstream>
10 #include <fstream>
11 #include <cassert>
12 #include <climits>
13 #include <cstdlib>
14 #include <cstring>
15 #include <string>
16 #include <cstdio>
17 #include <vector>
18 #include <cmath>
19 #include <queue>
20 #include <deque>
21 #include <stack>
22 #include <list>
23 #include <map>
24 #include <set>
26 #define foreach(x, v) for (typeof (v).begin() x = (v).begin(); x != (v).end(); ++x)
27 #define D(x) cout << #x " is " << x << endl
29 int main(){
30 int n = 1000;
31 printf("%d\n", n);
32 while (n--){
33 printf("%d\n", (random() % 2 ? 1 : -1) * random() % INT_MAX);
35 return 0;